Alternate Stacking Technique Revisited: Inclusion Problem of Superdeterministic Pushdown Automata
نویسندگان
چکیده
منابع مشابه
Simulation of Two-Way Pushdown Automata Revisited
The linear-time simulation of 2-way deterministic pushdown automata (2DPDA) by the Cook and Jones constructions is revisited. Following the semantics-based approach by Jones, an interpreter is given which, when extended with random-access memory, performs a linear-time simulation of 2DPDA. The recursive interpreter works without the dump list of the original constructions, which makes Cook’s in...
متن کاملRamsey-Based Inclusion Checking for Dense-Stack Visibly Pushdown Automata
Visibly pushdown automata are popular as they are closed under Boolean operations and determinization. There exist multiple notions of timed pushdown systems like recursive timed automata, densetime pushdown automata. We explore a generalization of visibly pushdown automata over infinite words with parity acceptance condition –in which stack elements have real valued time stamps–named dense-sta...
متن کاملReachability Problem for Weak Multi-Pushdown Automata
This paper is about reachability analysis in a restricted subclass of multi-pushdown automata: we assume that the control states of an automaton are partially ordered, and all transitions of an automaton go downwards with respect to the order. We prove decidability of the reachability problem, and computability of the backward reachability set. As the main contribution, we identify relevant sub...
متن کاملVisibly Pushdown Automata: Universality and Inclusion via Antichains
Visibly pushdown automata (VPAs), introduced by Alur and Madhusudan in 2004, are a useful formalism in various contexts, such as expressing and checking properties on control flows of programs, or on XML documents. In this context, we propose efficient antichain-based algorithms to check universality and inclusion of VPAs. Whereas the computation complexity is known to be ExpTime-complete for b...
متن کاملUnambiguity of SMGL Content Models - Pushdown Automata Revisited
We consider the property of unambiguity for regular expressions, extended by an additional operator &. This denotes concatenation in any order, and must have arbitrary arity since it is not associative. This extension gives us high succinctness in expressing equivalent regular expressions without &. The property of unambiguity means for a regular expression e, that a symbol in a word from its l...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IPSJ Online Transactions
سال: 2008
ISSN: 1882-6660
DOI: 10.2197/ipsjtrans.1.42